An efficient packetization algorithm for JPEG2000

This paper presents an efficient algorithm for post compression optimal rate allocation and packetization within JPEG2000 encoding. JPEG2000, the new ISO/ITU-T standard for still image coding, has been shown to provide superior coding efficiency to the previous standard, JPEG. However, the added efficiency of JPEG2000 comes at the cost of increased computational requirements. To improve the computational efficiency of JPEG2000, we propose a new algorithm for JPEG2000 rate allocation and packetization utilizing the D-Heap data structure. Implemented in Jasper and tested on five reference images, this algorithm provides a speedup for JPEG2000’s rate allocation and packetization of 15.9 times on average, and enables an average overall speedup of 33% for JPEG2000 encoding.